Efficient Reduced Basis Algorithm (ERBA) for Kernel-Based Approximation
نویسندگان
چکیده
Abstract The main purpose of this work is to provide an efficient scheme for constructing kernel-based reduced interpolation models. In the existing literature such problems are mainly addressed via well-established knot insertion or removal schemes. Such iterative strategies usually quite demanding from a computational point view and our goal study implementation data approaches, namely basis algorithm (ERBA). Focusing on interpolation, makes use two rules removing data. former, called ERBA- r , based classical residual evaluations. latter, p independent function values relies error bounds defined by power function. both cases, inspired so-called extended Rippa’s algorithm, ERBA takes advantage fast implementation.
منابع مشابه
Memory Efficient Kernel Approximation
Scaling kernel machines to massive data sets is a major challenge due to storage and computation issues in handling large kernel matrices, that are usually dense. Recently, many papers have suggested tackling this problem by using a low-rank approximation of the kernel matrix. In this paper, we first make the observation that the structure of shift-invariant kernels changes from low-rank to blo...
متن کاملEfficient Approximation Algorithms for Strings Kernel Based Sequence Classification
Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between k-mers (k-length subsequences) in the two sequences. Extending this definition, by considering two k-mers to match if their distance is at most m, yields better classification performance. This, howeve...
متن کاملEfficient Approximation Algorithms for String Kernel Based Sequence Classification
Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between k-mers (k-length subsequences) in the two sequences. Extending this definition, by considering two k-mers to match if their distance is at most m, yields better classification performance. This, howeve...
متن کاملKernel based approximation in Sobolev spaces with radial basis functions
In this paper, we study several radial basis function approximation schemes in Sobolev spaces. We obtain an optional error estimate by using a class of smoothing operators. We also discussed sufficient conditions for the smoothing operators to attain the desired approximation order. We then construct the smoothing operators by some compactly supported radial kernels, and use them to approximate...
متن کاملBASIS PURSUIT BASED GENETIC ALGORITHM FOR DAMAGE IDENTIFICATION
In damage detection the number of elements is generally more than the number of measured frequencies. Consequently, the corresponding damage detection equation is undetermined and thus has infinite solutions. Since in the damaged structures most of their elements remain healthy, the sparsest solution for the damage detection equation is mostly the actual damage. In the proposed method, the dama...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2022
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-022-01818-7